Forcing with Bushy Trees
نویسندگان
چکیده
We present several results that rely on arguments involving the combinatorics of “bushy trees”. These include the fact that there are arbitrarily slow-growing diagonally noncomputable (DNC) functions that compute no Kurtz random real, as well as an extension of a result of Kumabe in which we establish that there are DNC functions relative to arbitrary oracles that are of minimal Turing degree. Along the way, we survey some of the existing instances of bushy tree arguments in the literature.
منابع مشابه
Of Snowstorms and Bushy Trees
Many workloads for analytical processing in commercial RDBMSs are dominated by snowstorm queries, which are characterized by references to multiple large fact tables and their associated smaller dimension tables. This paper describes a technique for bushy join tree optimization for snowstorm queries in Oracle database system. This technique generates bushy join trees containing subtrees that pr...
متن کاملConstructing Optimal Bushy Processing Trees for Join Queries Is Np-hard
We show that constructing optimal bushy processing trees for join queries is NP-hard. More speciically, we show that even the construction of optimal bushy trees for computing the cross product of a set of relations is NP-hard.
متن کاملQuasi-actions on trees I. Bounded valence
Given a bounded valence, bushy tree T , we prove that any cobounded quasi-action of a group G on T is quasiconjugate to an action of G on another bounded valence, bushy tree T ′. This theorem has many applications: quasi-isometric rigidity for fundamental groups of finite, bushy graphs of coarse PD(n) groups for each fixed n; a generalization to actions on Cantor sets of Sullivan’s theorem abou...
متن کاملBeaver lodge location on the upstream Loire River.
In the part of the Loire River recently colonized by Eurasian beavers, we compared habitat characteristics among sites with lodges, sites with cut trees and sites without beaver. The absence of sandbank and canopy cover (by 10-15-m tall trees, by tall Salicaceae, and by bushy Salicaceae) appeared as good predictors for lodge settling. Based on this model, the number of proper lodge sites was es...
متن کاملManaging the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBT). Compared to the related approach of the General Bushy Trees (GBT) a signiicant complexity reduction of the operator ordering problem can be derived theoretically and demonstrated experimentally (e.g. compared with GBTs, L...
متن کامل